Clonal Selection Algorithm for Dynamic EconomicDispatch with Nonsmooth Cost Functions
نویسندگان
چکیده
This paper presents clonal selection algorithm to solve the Dynamic Economic Dispatch Problem (DEDP) of generating units considering valve point loading effects. It determines the optimal operation of units with predicted load demand over a certain period of time with an objective to minimize total production cost while the system is operating with ramp rate limits. This paper presents DED based on clonal selection technique for determination of the global or near global optimum dispatch solution. In the present case, load balance constraints, operating limits, valve point loading, ramp constraints and network loss coefficient are incorporated. Five unit test systems with non-linear characteristics of the generators are considered to illustrate the effectiveness of the proposed method. The feasibility of the proposed method is demonstrated and compared to those reported in the literature. The results are promising and show the effectiveness of the proposed method.
منابع مشابه
A hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands
This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algo...
متن کاملA New Immune Algorithm and Its Application
The traditional single clonal selection algorithm has a lot of disadvantages, for example, it is easy to be trapped into local optima, and it has a lot of massive redudacy iteration in its later period and inferior global search ability and so on. In this paper, a new artificial immune algorithm is proposed based on the clonal selection theory and the structure of anti-idiotype(IAAI), which is ...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملA class of multi-agent discrete hybrid non linearizable systems: Optimal controller design based on quasi-Newton algorithm for a class of sign-undefinite hessian cost functions
In the present paper, a class of hybrid, nonlinear and non linearizable dynamic systems is considered. The noted dynamic system is generalized to a multi-agent configuration. The interaction of agents is presented based on graph theory and finally, an interaction tensor defines the multi-agent system in leader-follower consensus in order to design a desirable controller for the noted system. A...
متن کامل